Data-Structures for Verification of Timed Automata
نویسندگان
چکیده
منابع مشابه
Verification for Timed Automata Extended with Unbounded Discrete Data Structures
We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper i...
متن کاملGeneralizing the Discrete Timed Automaton
We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in para...
متن کاملData-Structures for the Verification of Timed Automata
In this paper we suggest numerical decision diagrams, a bdd-based data-structure for representing certain subsets of the Euclidean space, namely those encountered in veriication of timed automata. Unlike other representation schemes, ndd's are canonical and provide for all the necessary operations needed in the veriication and synthesis of timed automata. We report some preliminary experimental...
متن کاملUnification & Sharing in Timed Automata Verification
We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60% and memory savings of up to 80% compared to previous implementations.
متن کاملVerification of Durational Action Timed Automata using UPPAAL
The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods. The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic) on real-time systems. The system behavi...
متن کامل